Splines over iterated Voronoi diagrams Draft
نویسنده
چکیده
We present a surface generation method which produces B-spline-like surfaces (or curves) in any dimension. We focus on the 2D quadratic case.
منابع مشابه
Randomized construction diagrams * incremental of abstract Voronoi Rolf
Abstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Voronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(n log n) by a randomized algorithm, which is based on Clarkson and Shor’s randomized incremental construction technique (1989). The new algorithm has the following advantages over previous algorithms: l It can handle a much wider cl...
متن کاملGeodesic Voronoi Diagrams on Parametric Surfaces
In this paper we will extend the concept of Voronoi diagrams to parameterized surfuces where distance between two points is defined as infimum over the lengths of surface paths connecting these points. We will present a method to compute Voronoi diagrams on these surfuces.
متن کاملRefinability of splines from lattice Voronoi cells
Splines can be constructed by convolving the indicator function of the Voronoi cell of a lattice. This paper presents simple criteria that imply that only a small subset of such spline families can be refined: essentially the well-known box splines and tensor-product splines. Among the many non-refinable constructions are hex-splines and their generalization to non-Cartesian lattices. An exampl...
متن کاملRandomized Incremental Construction of Abstract Voronoi Diagrams
Abstract Voronoi diagrams were introduced by R . Klein [Kle89b, Kle88a, Kle88b] as an axiomatic basis ofVoronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(nlogn) by a randomized algorithm, which is based on Clarkson and Shor's randomized incremental construction technique [CS89]. The new algorithm has the following advantages over previous algorithms: • It can handle...
متن کاملVoronoi Diagrams in Linear Time ∗
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003